Diameter and Stationary Distribution of Random $r$-out Digraphs

نویسندگان

  • Louigi Addario-Berry
  • Borja Balle
  • Guillem Perarnau
چکیده

Let D(n, r) be a random r-out regular directed multigraph on the set of vertices {1, . . . , n}. In this work, we establish that for every r ≥ 2, there exists ηr > 0 such that diam(D(n, r)) = (1 + ηr + o(1)) logr n. Our techniques also allow us to bound some extremal quantities related to the stationary distribution of a simple random walk on D(n, r). In particular, we determine the asymptotic behaviour of πmax and πmin, the maximum and the minimum values of the stationary distribution. We show that with high probability πmax = n −1+o(1) and πmin = n −(1+ηr)+o(1). Our proof shows that the vertices with π(v) near to πmin lie at the top of “narrow, slippery towers”; such vertices are also responsible for increasing the diameter from (1+o(1)) logr n to (1+ηr+o(1)) logr n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stationary distribution and cover time of random walks on random digraphs

We study properties of a simple random walk on the random digraph Dn,p when np = d log n, d > 1. We prove that whp the value πv of the stationary distribution at vertex v is asymptotic to deg(v)/m where deg(v) is the in-degree of v and m = n(n − 1)p is the expected number of edges of Dn,p. If d = d(n) → ∞ with n, the stationary distribution is asymptotically uniform whp. Using this result we pr...

متن کامل

More skew-equienergetic digraphs

Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this  paper, we give some new methods to construct new skew-equienergetic digraphs.

متن کامل

Randomized Search of Graphs in Log Space and Probabilistic Computation

Reingold has shown that L = SL, that s-t connectivity in a poly-mixing digraph is complete for promise-RL, and that s-t connectivity for a poly-mixing out-regular digraph with known stationary distribution is in L. Several properties that bound the mixing times of random walks on digraphs have been identified, including the digraph conductance and the digraph spectral expansion. However, rapidl...

متن کامل

Second Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline

In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...

متن کامل

Synchronizing automata and principal eigenvectors of the underlying digraphs

A coloring of a digraph with a fixed out-degree k is a distribution of k labels over the edges resulting in a deterministic finite automaton. An automaton is called synchronizing if there exists a word which sends all states of the automaton to a single state. In the present paper we study connections between spectral and synchronizing properties of digraphs. We show that if a coloring of a dig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1504.06840  شماره 

صفحات  -

تاریخ انتشار 2015